- complex polygon
- регион, сложный полигон (имеющий отверстия и/или состоящий из нескольких простых)
Англо-русский толковый словарь по геоинформатике. В.Ю. Андрианов. 2015.
complex polygon
Смотреть что такое "complex polygon" в других словарях:
Complex polygon — The term complex polygon can mean two different things: In computer graphics, as a polygon which is neither convex nor concave. In geometry, as a polygon in the unitary plane, which has two complex dimensions. Contents 1 Computer graphics 2… … Wikipedia
Polygon — For other uses, see Polygon (disambiguation). Some polygons of different kinds In geometry a polygon ( … Wikipedia
Complex polytope — A complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. On a real line, two points bound a segment. This defines an… … Wikipedia
Polygon mesh — A polygon mesh or unstructured grid is a collection of vertices, edges and faces that defines the shape of a polyhedral object in 3D computer graphics and solid modeling. The faces usually consist of triangles, quadrilaterals or other simple… … Wikipedia
Polygon triangulation — In computational geometry, polygon triangulation is the decomposition of a polygon into a set of triangles.A triangulation of a polygon P is its partition into non overlapping triangles whose union is P. In the strictest sense, these triangles… … Wikipedia
Complex number — A complex number can be visually represented as a pair of numbers forming a vector on a diagram called an Argand diagram, representing the complex plane. Re is the real axis, Im is the imaginary axis, and i is the square root of –1. A complex… … Wikipedia
Star polygon — Set of regular star polygons {5/2} {7/2} … Wikipedia
Simple polygon — In geometry, a simple polygon is a polygon whose sides do not intersect. They are also called Jordan polygons, because the Jordan curve theorem can be used to prove that such a polygon divides the plane into two regions, the region inside it and… … Wikipedia
Petrie polygon — In geometry, a Petrie polygon is a skew polygon such that every two consecutive sides (but no three) belong to a face of a regular polyhedron.This definition extends to higher regular polytopes. A Petrie polygon for an n polytope is a skew… … Wikipedia
GPC General Polygon Clipper Library — The University of Manchester GPC library is a software library providing an API for computing the results of clipping operations on sets of polygons. It generalises the computer graphics clipping problem of intersecting polygons with polygons.The … Wikipedia
Point in polygon — In computational geometry, the point in polygon (PIP) problem asks whether a given point in the plane lies inside, outside, or on the boundary of a polygon. It is a special case of point location problems and finds applications in areas that deal … Wikipedia
